-
1 Viterbi maximum likelihood decoding
декодирование по максимуму правдоподобия по Витерби
—
[ http://www.iks-media.ru/glossary/index.html?glossid=2400324]Тематики
- электросвязь, основные понятия
EN
Англо-русский словарь нормативно-технической терминологии > Viterbi maximum likelihood decoding
-
2 decoding
2) демодуляция•- decision-directed decoding
- differential decoding
- erasure decoding
- erasure-and-error decoding
- feedback decoding
- hard-decision decoding
- linguistic decoding
- list decoding
- majority decoding
- maximum-likelihood decoding
- Reed-Solomon decoding
- sequential decoding
- soft-decision decoding
- step-by-step decoding
- stereo decoding
- syndrome decoding
- threshold decoding
- Viterbi decoding -
3 decoding
2) демодуляция•- decision-directed decoding
- differential decoding
- erasure decoding
- erasure-and-error decoding
- feedback decoding
- hard-decision decoding
- linguistic decoding
- list decoding
- majority decoding
- maximum-likelihood decoding
- Reed-Solomon decoding
- sequential decoding
- soft-decision decoding
- step-by-step decoding
- stereo decoding
- syndrome decoding
- threshold decoding
- Viterbi decodingThe New English-Russian Dictionary of Radio-electronics > decoding
См. также в других словарях:
Decoding methods — In communication theory and coding theory, decoding is the process of translating received messages into codewords of a given code. There has been many common methods of mapping messages to codewords. These are often used to recover messages sent … Wikipedia
Viterbi decoder — A Viterbi decoder uses the Viterbi algorithm for decoding a bitstream that has been encoded using forward error correction based on a convolutional code. There are other algorithms for decoding a convolutionally encoded stream (for example, the… … Wikipedia
Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… … Wikipedia
Viterbi — Der Viterbi Algorithmus ist ein Algorithmus der Dynamischen Programmierung zur Bestimmung der wahrscheinlichsten Sequenz von versteckten Zuständen bei einem gegebenen Hidden Markov Model und einer beobachteten Sequenz von Symbolen. Diese… … Deutsch Wikipedia
Viterbi-Algorithmus — Der Viterbi Algorithmus ist ein Algorithmus der Dynamischen Programmierung zur Bestimmung der wahrscheinlichsten Sequenz von versteckten Zuständen bei einem gegebenen Hidden Markov Model und einer beobachteten Sequenz von Symbolen. Diese… … Deutsch Wikipedia
Andrea Viterbi — Der Viterbi Algorithmus ist ein Algorithmus der Dynamischen Programmierung zur Bestimmung der wahrscheinlichsten Sequenz von versteckten Zuständen bei einem gegebenen Hidden Markov Model und einer beobachteten Sequenz von Symbolen. Diese… … Deutsch Wikipedia
Andrew Viterbi — Der Viterbi Algorithmus ist ein Algorithmus der Dynamischen Programmierung zur Bestimmung der wahrscheinlichsten Sequenz von versteckten Zuständen bei einem gegebenen Hidden Markov Model und einer beobachteten Sequenz von Symbolen. Diese… … Deutsch Wikipedia
Consultative Committee for Space Data Systems — The Consultative Committee for Space Data Systems (CCSDS) was formed in 1982 by the major space agencies of the world to provide a forum for discussion of common problems in the development and operation of space data systems. The Committee meets … Wikipedia
декодирование по максимуму правдоподобия по Витерби — — [http://www.iks media.ru/glossary/index.html?glossid=2400324] Тематики электросвязь, основные понятия EN Viterbi maximum likelihood decoding … Справочник технического переводчика
Convolutional code — In telecommunication, a convolutional code is a type of error correcting code in which each m bit information symbol (each m bit string) to be encoded is transformed into an n bit symbol, where m/n is the code rate (n ≥ m) and the transformation… … Wikipedia
Concatenated error correction code — In coding theory, concatenated codes form a class of error correcting codes that are derived by combining an inner code and an outer code. They were conceived in 1966 by Dave Forney as a solution to the problem of finding a code that has both… … Wikipedia